Trading Votes for Votes: An Experimental Study∗
نویسندگان
چکیده
Trading votes for votes is believed to be ubiquitous in committees and legislatures, and yet we know very little of its properties. We return to this old question with a laboratory experiment and a simple theoretical framework. We posit a family of minimally rational trading rules such that pairs of voters can exchange votes when mutually advantageous. Such rules always lead to stable vote allocations—allocations where no further improving trades exist. Our experimental data show that stability has predictive power: vote allocations in the lab converge towards stable allocations, and individual vote holdings at the end of trading are in line with our theoretical predictions. However, there is only weak support for the dynamic trading rules themselves, and although trading is frequent final outcomes show significant inertia around pre-trade outcomes. JEL Classification: D70, D72, P16
منابع مشابه
Trading Votes for Votes . ∗ A Decentralized Matching
We study vote trading—trading of votes for votes—through the tools of the matching literature. Decentralized vote trading is modeled via an algorithm that executes a sequence of binding, myopic, strictly improving pair-wise trades. We show that with binary alternatives, an odd number of voters, and separable preferences, the sequence always converges to a stable vote allocation—a distribution o...
متن کاملA Theory of Vote Trading and Information Aggregation†
The ability to buy “empty votes” by using derivative contracts to separate shares’ voting and cash flow rights is a cause of policy concern. We construct a formal model of a market for empty votes where informed and uninformed (and potentially biased) shareholders endogenously choose to demand or supply. There always exists an equilibrium where only informed shareholders demand votes, since uni...
متن کاملارائه الگوریتم شناسایی ستاره بر مبنای رأیگیری هندسی به منظور استفاده در ردیابهای ستارهای
Star identification is one of the most important stages in attitude determination with star trackers. This can be performed using matching algorithms between observed stars and a master star catalogue. The main challenge in this approach is to provide a fast and reliable identification algorithm that is sufficiently robust in different pointing views of the star tracker optical system in the sp...
متن کاملVote Trading With and Without Party Leaders
Two groups of voters of known sizes disagree over a single binary decision to be taken by simple majority. Individuals have different, privately observed intensities of preferences and before voting can buy or sell votes among themselves for money. We study, theoretically and experimentally, the implication of such trading for outcomes and welfare when trades are coordinated by the two group le...
متن کاملTrading Votes for Votes.1 A Decentralized Matching Algorithm
Vote-trading is common practice in committees and group decision-making. Yet we know very little about its properties. Inspired by the similarity between the logic of sequential rounds of pairwise vote-trading and matching algorithms, we explore three central questions that have parallels in the matching literature: (1) Does a stable allocation of votes always exists? (2) Is it reachable throug...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017